Robust Path Planning with Imperfect Maps
نویسندگان
چکیده
We describe an efficient method for path planning in environments for which prior maps are plagued with uncertainty. Our approach processes the map to determine key areas whose uncertainty is crucial to the planning task. It then incorporates the uncertainty associated with these areas using the recently developed PAO* algorithm to produce a fast, robust solution to the original planning task. We present results from a simulated outdoor navigation scenario.
منابع مشابه
Path planning for the Cye personal robot
In this paper, we describe the Cye personal robot, concentrating on its path planning and navigation. We start out with a brief description of the general problem, followed by more detail on the Cye robot. After that, we concentrate on the path planner, which uses a global potential field approach, combined with a novel optimization criterion. This ensures that the robot maintains adequate dist...
متن کاملKinematic path-following control of a mobile robot under bounded angular velocity error
This paper proposes a robust path-following control method of a kinematic mobile robot system subject to bounded angular velocity error. The angular velocity error usually arises from imperfect performance of the dynamic control system. Given a kinematic model of the mobile robot system with bounded angular velocity error, we present a stable and robust path-following controller which is based ...
متن کاملOptimal robust path planning in general environments
We address robust path planning for a mobile agent in a general environment by finding minimum cost source-destination paths having prescribed widths. The main result is a new approach that optimally solves the robust path planning problem using an efficient network flow formulation. Our algorithm represents a significant departure from conventional shortest-path or graph search based methods; ...
متن کاملOn Motion Planning for Dexrerous Manipulation, Part I: 3 Simulation Results
We address robust path planning for a mobile agent in a general environment by nding minimum cost source-destination paths having prescribed widths. The main result is a new approach which optimally solves the robust path planning problem using an e cient network ow formulation. Our algorithm represents a signi cant departure from conventional shortest-path or graph search based methods; it not...
متن کاملReal-time Planning for Single Agents and Multi-agent Teams in Unknown and Dynamic Environments
As autonomous agents make the transition from solving simple, well-behaved problems to being useful entities in the real world, they must deal with the added complexity and uncertainty inherent in real environments. In particular, agents navigating through the real world can be confronted with incomplete or imperfect information (e.g. when prior maps are absent or incomplete), large state space...
متن کامل